Teaching intermediate-level technical and musical skills through the study and performance of selected piano duos

The study and performance of ensemble repertoire can provide benefits at all levels of music study. Playing piano duos (two people at two pianos) is enjoyable for young students and can help maintain their interest in playing the piano. Furthermore, skills acquired in duo-piano playing, such as communication, coordination, and balance can not only be transferred to solo and/or duet performance, but can also develop a foundation for performing other types of chamber music, thus preparing young students to accompany other instrumentalists or vocalists or even a choir in the near future.;This study provides a pedagogical guide that presents suggestions for teaching intermediate-level technical, musical skills, and collaborative skills through the study of selected intermediate-level piano duos from various musical periods. Specific technical and musical skills that students can hone from the study of this repertoire (including rhythm, phrasing and articulation, dynamics, musical style, balance, pedaling, and coordination of the ensemble) are discussed from the pedagogical standpoint

catena-Poly[[[aqua­(5-nitro­benzene-1,2,3-tricarboxyl­ato-κO 1)nickel(II)]-di-μ-aqua-[diaqua­sodium]-di-μ-aqua] tetra­hydrate]

In the title complex, {[NaNi(C9H2NO8)(H2O)7]·4H2O}n, the NiII atom has a distorted octa­hedral coordination, defined by five O atoms from five water mol­ecules and one O atom from one 5-nitro­benzene-1,2,3-tricarboxyl­ate ligand. The Na cation is coordinated by six water O atoms in an irregular trigonal-prismatic geometry. There are seven coordinated water mol­ecules in the asymmetic unit. The Ni and Na atoms are linked by water bridges, forming infinite chains, which are connected by strong O—H⋯O hydrogen bonds involving the coordinated and uncoordinated water mol­ecules into a three-dimensional network

Application of Gaode OPEN API in the Fire-Fighting Facility Planning Evaluation

n recent years, big data has been extensively applied in urban planning and design area. However, its wider application is constrained by the data acquisition approach. Accordingly, many efforts have been made to accurately find and solve urban problems by mining legal open source internet data, which gradually becomes a hot topic among urban researchers. In this context, this study applies the Gaode OPEN API in the urban real-time traffic circle construction and fire-fighting facility planning evaluation taking Nanjing as example. First, a batch processing model is established on the basis of Gaode OPEN API, including automatic acquisition of real-time traffic data in the study area and extraction of average vehicle speed of all the roads during specified time period. It found that speed involves division of the whole Nanjing City into several characteristic zones. Then, a case study is conducted to construct the urban real-time traffic circle through python language and Arcgis software based on existing fire-fighting facilities. In the end, through a subsequent evaluation, it is found that the existing fire-fighting facility planning has a stark regional difference between urban central area and suburban area, which shows a low coverage rate of 22% and 39% for respond time of 6min and 8min respectively. This study provides an integrated approach for acquisition and processing of Gaode data, mining of its space-time features, and application in the planning evaluation practice. This approach demonstrates the advantages of streaming features and distributed processing of big data, effectively utilizes the real-time characteristics of big data in the emergency facility planning, and is expected to broaden ideas for data acquisition

Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems

The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms only need to calculate the projection on the feasible set once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the cost operator and do not contain any line search process. The strong convergence of the algorithms is established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.Comment: 25 pages, 12 figure